Identifying influential nodes in complex networks: Effective distance gravity model
نویسندگان
چکیده
The identification of important nodes in complex networks is an area exciting growth due to its applications across various disciplines like disease control, data mining and network system control. Many measures have been proposed date, but they are either based on the locality or global nature network. These typically use traditional Euclidean Distance , which only focuses local static geographic distance between ignores dynamic interaction real-world networks. Both information should be considered for purpose identifying influential . In order address this problem, we original novel gravity model with effective fusion multi-level processing. Our method able comprehensively consider networks, also utilizes incorporate information. Moreover, can help us mine hidden topological structure more accurate results. susceptible infected model, Kendall correlation coefficient eight existing methods utilized carry out simulations twelve different real
منابع مشابه
Identifying influential nodes in complex networks
Identifying influential nodes that lead to faster and wider spreading in complex networks is of theoretical and practical significance. The degree centrality method is very simple but of little relevance. Global metrics such as betweenness centrality and closeness centrality can better identify influential nodes, but are incapable to be applied in large-scale networks due to the computational c...
متن کاملIdentifying influential nodes in complex networks with community structure
Article history: Received 2 July 2012 Received in revised form 14 January 2013 Accepted 16 January 2013 Available online 26 January 2013
متن کاملIdentifying influential spreaders in complex networks based on gravity formula
How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value of each node as its mass and the shortest path distance between two nodes as their distance, then inspired by the idea of the gravity formula, we propose a gr...
متن کاملLocating influential nodes in complex networks
Understanding and controlling spreading processes in networks is an important topic with many diverse applications, including information dissemination, disease propagation and viral marketing. It is of crucial importance to identify which entities act as influential spreaders that can propagate information to a large portion of the network, in order to ensure efficient information diffusion, o...
متن کاملIdentifying influential spreaders in complex networks
Maksim Kitsak, 2 Lazaros K. Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H. Eugene Stanley, and Hernán A. Makse Center for Polymer Studies and Physics Department, Boston University, Boston, Massachusetts 02215, USA Cooperative Association for Internet Data Analysis (CAIDA), University of California-San Diego, La Jolla, California 92093, USA Levich Institute and Physics Department, City...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2021
ISSN: ['0020-0255', '1872-6291']
DOI: https://doi.org/10.1016/j.ins.2021.01.053